Binomial Hadamard Series and Inequalities over the Spectra of a Strongly Regular Graph

A Series of Regular Hadamard Matrices

Let p and 2p − 1 be prime powers and p ≡ 3 (mod 4). Then there exists a symmetric design with parameters (4p, 2p − p, p − p). Thus there exists a regular Hadamard matrix of order 4p. AMS classification numbers: 05B20, 05B05

On the Strongly Regular Graph of Parameters

In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we studied its possible substructure and constructions.

Generation of Strongly Regular Graphs from Normalized Hadamard Matrices

This paper proposes an algorithm which can be used to construct strongly regular graphs from Hadamard matrices.A graph is strongly regular if there are integers and such that every two adjacent vertices have common neighbours and every two non adjacent vertices have common neighbors. Proposed method is mainly based on basic matrix manipulations. If the order of the normalized Hadamard matr ix i...

The Maximum Number of Edges in a Strongly Multiplicative Graph

the investigation of the relationship between type a and type b personalities and quality of translation

چکیده ندارد.